Axiomatizing Category Theory in Free Logic
نویسندگان
چکیده
Starting from a generalization of the standard axioms for a monoid we present a stepwise development of various, mutually equivalent foundational axiom systems for category theory. Our axiom sets have been formalized in the Isabelle/HOL interactive proof assistant, and this formalization utilizes a semantically correct embedding of free logic in classical higher-order logic. The modeling and formal analysis of our axiom sets has been significantly supported by series of experiments with automated reasoning tools integrated with Isabelle/HOL. We also address the relation of our axiom systems to alternative proposals from the literature, including an axiom set proposed by Freyd and Scedrov for which we reveal a technical flaw: either all operations, e.g. morphism composition, are total or their axiom system is inconsistent. The repair for this problem is quite straightforward, however.
منابع مشابه
Quantifier Elimination for a Class of Intuitionistic Theories
From classical, Fräıssé-homogeneous, (≤ ω)-categorical theories over finite relational languages (which we refer to as JRS theories), we construct intuitionistic theories that are complete, prove negations of classical tautologies, and admit quantifier elimination. The technique we use considers Kripke models as functors from a small category to the category of L-structures with morphisms, rath...
متن کاملCombining Equational Theories Sharing Non-Collapse-Free Constructors
In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension broadens the scope of the combination procedure considerably, for example in the direction of equational theories axiomatizing the equivalence of modal formulae.
متن کاملAxiomatizing proof tree concepts in Bounded Arithmetic
We construct theories of Cook-Nguyen style two-sort bounded arithmetic whose provably total functions are exactly those in LOGCFL and LOGDCFL. Axiomatizations of both theories are based on the proof tree size characterizations of these classes. We also show that our theory for LOGCFL proves a certain formulation of the pumping lemma for context-free languages. 1998 ACM Subject Classification F....
متن کاملAxiomatizing geometric constructions
In this survey paper, we present several results linking quantifier-free axiomatizations of various Euclidean and hyperbolic geometries in languages without relation symbols to geometric constructibility theorems. Several fragments of Euclidean and hyperbolic geometries turn out to be naturally occurring only when we ask for the universal theory of the standard plane (Euclidean or hyperbolic), ...
متن کاملMorphism axioms
We introduce a new concept in the area of formal logic: axioms for model morphisms. We work in the setting of specification languages that define the semantics of a theory as a category of models. While it is routine to use axioms to specify the class of models of a theory, there has so far been no analogue to systematically specify the morphisms between these models. This leads to subtle probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1609.01493 شماره
صفحات -
تاریخ انتشار 2016